A Cost-Regular Based Hybrid Column Generation Approach
نویسندگان
چکیده
منابع مشابه
A Hybrid Column Generation Approach for the Berth Allocation Problem
The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a recently proposed evolutionary hybrid method denominated PTA/LP is used to solve it. The PTA/LP combines the Population Training Algorithm with Linear Programming to generate improving incoming columns in a column generation proces...
متن کاملA column generation approach for examination timetabling
In examination timetabling we have to assign the exams of a given set of courses to time slots, such that conflicting exams are assigned to different time slots. We study the problem that occurs at our department. The characteristics of this problem are as follows. The exams have to take place in 5 days, and per day there are 2 time slots. Teachers can express their preferences for the time slo...
متن کاملA Column Generation Approach for Graph Coloring
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branch-and-bound tree. This approach, while requiring the solution of a diicult subproblem as well as needing sophisticated branchin...
متن کاملSchool bus routing - a column generation approach
The School Bus Routing Problem (SBRP), a generalization of the well-known Vehicle Routing Problem, involves the routing, planning, and scheduling of public school bus transportation. The problem can be divided into several subproblems, including bus stop selection, assigning students to buses, and determining the bus routes. This work presents an exact branch-and-price framework for the SBRP, w...
متن کاملColumn Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Extensions to the context of a column generation solution approach are not straightforward. The Dantzig-Wolfe decomposition principle can indeed be exploited in greedy, local search, rounding or truncated exact methods. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2006
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-006-9003-7